Method and configuration for determining a sequence of actions for a system which comprises statuses, whereby a status transition ensues between two statuses as a result of an action

ABSTRACT

A determination of a sequence of actions is performed such that a sequence of states resulting from the sequence of actions is optimized using a prescribed optimization function. The optimization function includes a variable parameter with which it is possible to establish a risk relating to the resulting sequence of states based upon a prescribed state of the system.

BACKGROUND OF THE INVENTION

1. Field of the Invention

This invention generally pertains to systems having states, and in particular to methods for determining a sequence of actions for such systems.

2. Discussion of the Related Art

A generalized method and arrangement for determining a sequence of actions for a system having states, wherein a transition in state between two states is performed on the basis of an action, is discussed by Neuneier in “Enhancing Q-Learning for Optimal Asset Allocation”, appearing in the Proceedings of the Neural Information Processing Systems, NIPS 1997. Neuneier describes a financial market as an example of a system which has states. His system is described as a Markov Decision Problem (MDP).

The characteristics of a Markov Decision Problem are represented below by way of summary:

X set of possible states of the system, e.g. X=

^(m),

A(x_(t)) set of possible actions in the state

p(x_(t+1)|x_(t),a_(t)) x_(t)

r(x_(t), a_(t), x_(t+1)) gain with expectation R(x_(t), a_(t)).

Starting from observable variables, the variables denoted below as training data, the aim is to determine a strategy, that is to say a sequence of functions π={μ₀,μ₁, K, μ_(T)},  (3) which at each instant t map each state into an action rule, that is to say action μ_(t)(x_(t))=a_(t)  (4)

Such a strategy is evaluated by an optimization function.

The optimization function specifies the expectation, the gains accumulated over time at a given strategy π, and a start state x₀.

The so-called Q-learning method is described by Neuneier as an example of a method of approximative dynamic programming.

An optimum evaluation function V^(*)(x) is defined by V ^(*)(x)=_(π) ^(max) V^(π)(x)∀x εX   (5) where

$\begin{matrix} {{{V^{\pi}(x)} = {E\left\lbrack {\left. {\sum\limits_{t = 0}^{\infty}\;{\gamma^{t}{r\left( {x_{t},\mu_{t},{x_{t} + 1}} \right)}}} \middle| x_{0} \right. = x} \right\rbrack}},} & (6) \end{matrix}$ γ denoting a prescribable reduction factor which is formed in accordance with the following rule:

$\begin{matrix} {{\gamma = \frac{1}{1 + z}},} & (7) \end{matrix}$ z∈ρ ⁺.  (8)

A Q-evaluation function Q^(*)(x_(t),a_(t)) is formed within the Q-learning method for each pair (state x_(t), action a_(t)) in accordance with the following rule:

$\begin{matrix} \begin{matrix} {{Q^{*}\left( {x_{t},a_{t}} \right)}:={{\sum\limits_{x\;\varepsilon\; X}\;{{p\left( {\left. x_{t + 1} \middle| x_{t} \right.,a_{t}} \right)} \cdot r_{t}}} +}} \\ {{+ \gamma} \cdot {\sum\limits_{x\;\varepsilon\; X}\;{{p\left( {\left. x \middle| x_{t} \right.,a_{t}} \right)} \cdot {\max\limits_{a\;\varepsilon\; A}\mspace{14mu}\left( {Q^{*}\left( {x,a} \right)} \right)}}}} \end{matrix} & (9) \end{matrix}$

On the basis respectively of the tupel (x_(t), x_(t+1), a_(t), r_(t)), the Q-values Q^(*) (x,a) are adapted in the k+1 th iteration in accordance with the following learning rule with a prescribed learning rate η_(k) in accordance with the following rule:

$\begin{matrix} {{Q_{k + 1}\left( {x_{t},a_{t}} \right)} = {{\left( {1 - \eta_{k}} \right){Q_{k}\left( {x_{t},a_{t}} \right)}} + {{\eta_{k}\left( {r_{t} + {\gamma\mspace{14mu}{\max\limits_{a\;\varepsilon\; A}\mspace{20mu}\left( {Q_{k}\left( {x_{t + 1},a} \right)} \right)}}} \right)}.}}} & (10) \end{matrix}$

Usually, the so-called Q-values Q^(*)(x,a) are approximated for various actions by a function approximator in each case, for example a neural network or a polynomial classifier, with a weighting vector w^(a), which contains weights of the function approximator.

A function approximator is, for example, a neural network, a polynomial classifier or a combination of a neural network with a polynomial classifier.

It therefore holds that: Q ^(*)(x, a)≈Q(x; w^(a)).   (11)

Changes in the weights in the weighting vector w^(a) are based on a temporal difference d_(t) which is formed in accordance with the following rule:

$\begin{matrix} {d_{t}:={{r\left( {x_{t},a_{t},x_{t + 1}} \right)} + {\gamma\mspace{14mu}{\max\limits_{a\;\varepsilon\; A}\mspace{14mu}{Q\left( {x_{t + 1};w_{k}^{a}} \right)}}} - {Q\left( {x_{t};w_{k}^{a_{t}}} \right)}}} & (12) \end{matrix}$

The following adaptation rule for the weights of the neural network, which are included in the weighting vector w^(a), follows for the Q-learning method with the use of a neural network:

$\begin{matrix} {w_{k + 1}^{a_{t}} = {w_{k}^{a_{t}} + {\eta_{k} \cdot d_{t} \cdot {{\nabla{Q\left( {x_{t};w_{k}^{a_{t}}} \right)}}.}}}} & (13) \end{matrix}$

The neural network representing the system of a financial market as described by Neuneier is trained using the training data which describe information on changes in prices on a financial market as time series values.

A further method of approximative dynamic programming is the so-called TD(λ) learning method. This method is discussed in R.S. Sutton's, “Learning To Predict By The Method Of Temporal Differences”, appearing in Machine Learning, Chapter 3, pages 9–44, 1988.

Furthermore, it is known from M. Heger's, “Risk and Reinforcement Learning: Concepts and Dynamic Programming”, ZKW Bericht No. Aug. 1994, Zentrum für Kognitionswissenschaften [Center for Cognitive Sciences], Bremen University, December 1994, that risk is associated with a strategy π and an initial state x_(t). A method for risk avoidance is also discussed by Hager, cited above.

The following optimization function, which is also referred to as an expanded Q-function Q^(π)(x_(t), a_(t)), is used in the Heger method:

$\begin{matrix} \left( {{{\underset{\_}{Q}}^{\pi}\left( {x_{t},a_{t}} \right)}:={{r\left( {x_{t},a_{t},x_{t + 1}} \right)} + {\inf\limits_{\underset{{p{({x_{0},x_{1},K})}} > 0}{x_{0},x_{1},K}}\left\{ {\sum\limits_{k = 1}^{\infty}\;{\gamma^{k}{r\left( {x_{k},{\pi\left( x_{k} \right)},x_{k + 1}} \right)}}} \right\}}}} \right) & (14) \end{matrix}$

The expanded Q-function Q^(π)(x_(t), a_(t)) describes the worst case if the action a_(t) is executed in the state x_(t) and the strategy π is followed thereupon.

The optimization function Q^(π)(x_(t), a_(t)) for

$\begin{matrix} {{{\underset{\_}{Q}}^{*}\;\left( {x_{t},a_{t}} \right)}:={\max\limits_{\pi\; \in \prod}\mspace{14mu}{{\underset{\_}{Q}}^{\pi}\;\left( {x_{t},a_{t}} \right)}}} & (15) \end{matrix}$ is given by the following rule:

$\begin{matrix} {{{\underset{\_}{Q}}^{*}\;\left( {x_{t},a_{t}} \right)} = \mspace{14mu}{\min\limits_{\underset{{p{({{x_{t + 1}|x_{t}},a_{t}})}} > 0}{x\;\varepsilon\; X}}{\left( {{r\left( {x_{t},a_{t},x} \right)} + {\gamma \cdot {\max\limits_{a\;\varepsilon\; A}{{\underset{\_}{Q}}^{*}\left( {x,a} \right)}}}} \right).}}} & (16) \end{matrix}$

A substantial disadvantage of this mode of procedure is that only the worst case is taken into account when finding the strategy. However, this inadequately reflects the requirements of the most varied technical systems.

In “Dynamic Programming and Optimal Control”, Athena Scientific, Belmont, Mass., 1995, D.P. Bertsekas formulates access control for a communications network and routing within the communications network as a problem of dynamic programming.

Therefore, the present invention is based on the problem of specifying a method and system for determining a sequence of actions in which the method or sequences of actions achieve an increased flexibility in determining the strategy needed.

In a method for computer-aided determination of a sequence of actions for a system which has states, a transition in state between two states being performed on the basis of an action, the determination of the sequence of actions is performed in such a way that a sequence of states resulting from the sequence of actions is optimized with regard to a prescribed optimization function, the optimization function including a variable parameter with the aid of which it is possible to set a risk which the resulting sequence of states has with respect to a prescribed state of the system.

A system for determining a sequence of actions for a system which has states, a transition in state between two states being performed on the basis of an action, has a processor which is set up in such a way that the determination of the sequence of actions can be performed in such a way that a sequence of states resulting from the sequence of actions is optimized with regard to a prescribed optimization function, the optimization function including a variable parameter with the aid of which it is possible to set a risk which the resulting sequence of states has with respect to a prescribed state of the system.

Thus, the present invention offers a method for determining a sequence of actions at a freely prescribable level of accuracy when finding a strategy for a possible closed-loop control or open-loop control of the system, in general for influencing it. Hence, the embodiments described below are valid both for the method and for the system.

Approximative dynamic programming is used for the purpose of determination, for example a method based on Q-learning or a method based on TD(λ)-learning.

Within Q-learning, the optimization function OFQ is preferably formed in accordance with the following rule: OFQ=Q(x; w ^(a)), x denoting a state in a state space X a denoting an action from an action space A, and w^(a) denoting the weights of a function approximator which belong to the action a.

The following adaptation step is executed during Q-learning in order to determine the optimum weights w^(a) of the function approximator:

w t + 1 a t = w t a t + η t · κ ⁢ ( d t ) · ∇ Q ⁡ ( x t ; w t a t ) ⁢ with the abbreviation

$d_{t} = {{r\left( {x_{t},a_{t},x_{t + 1}} \right)} + {\gamma\mspace{14mu}{\max\limits_{a\;\varepsilon\; A}\mspace{14mu}{Q\left( {x_{t + 1},w_{t}^{a}} \right)}}} - {Q\left( {x_{t},w_{t}^{a_{t}}} \right)}}$ x_(t), x_(t)+1 respectively denoting a state in the state space X, a_(t) denoting an action from an action space A, γ denoting a prescribable reduction factor, w_(t) ^(a) ^(t) denoting the weighting vector associated with the action a_(t) before the adaptation step, w_(t+1) ^(a) ^(t) denoting the weighing vector associated with the action a_(t) after the adaptation step, η_(t)(t=1, . . . ) denoting a prescribable step size sequence, κε[−1; 1] denoting a risk monitoring parameter,

^(κ) denoting a risk monitoring function

^(κ) (ξ)=(1−κsign(ξ))ξ, ∇Q(;) denoting the derivation of the function approximator according to its weights, and r(x_(t), a_(t), x_(t+1)) denoting a gain upon the transition of state from the state x_(t) to the subsequent state x_(t+1).

The optimization function is preferably formed in accordance with the following rule within the TD(λ)-learning method:

OFTD=J(x;w)

x denoting a state in a state space X,

a denoting an action from an action space A, and

w denoting the weights of a function approximator.

The following adaptation step is executed during TD(λ)-learning in order to determine the optimum weights w of the function approximator: w _(t+1) =w _(t)+η_(t)·

^(κ)(d _(t))·z _(t) with the abbreviations d _(t) =r(w _(t) , a _(t) , x _(t+1))+γJ(x _(t+1) ; w _(t))−J(x _(t) ; w _(t)), z _(t) =λ·γ·z _(t−1) +∇J(x _(t) ; w _(t)), z ₁=0 x_(t), x_(t+1) respectively denoting a state in the state space X, a_(t) denoting an action from an action space A, γ denoting a prescribable reduction factor, w_(t) denoting the weighting vector before the adaptation step, w_(t+1) denoting the weighting vector after the adaptation step, η_(t) (t=1, . . . ) denoting a prescribable step size sequence, κε[−1; 1] denoting a risk monitoring parameter,

^(κ) denoting a risk monitoring function

^(κ)(ξ)=(1−κsign(ξ))ξ, ∇J(;) denoting the derivation of the function approximator according to its weights, and r(x _(t) , a _(t) , x _(t+1)) denoting a gain upon the transition of state from the state x_(t) to the subsequent state x_(t+1).

SUMMARY OF THE INVENTION

It is an object of the present invention to provide a technical system and method for determining a sequence of actions using measured values.

It is another object of the present invention to provide a technical system and method that can be subjected to open-loop control or closed-loop control with the use of a determined sequence of actions.

It is a further object of the invention to provide a technical system and method modeled as a Markov Decision Problem.

It is an additional object of the invention to provide a technical system and method that can be used in a traffic management system.

It is yet another object of the invention to provide a technical system and method that can be used in a communications system, such that a sequence of actions is used to carry out access control, routing or path allocation.

It is yet a further object of the invention to provide a technical system and method for a financial market modeled by a Markov Decision Problem, wherein a change in an index of stocks, or a change in a rate of exchange on a foreign exchange market, makes it possible to intervene in the market in accordance with a sequence of determined actions.

These and other objects of the invention will be apparent from a careful review of the following detailed description of the preferred embodiments, which is to read in conjunction with a review of the accompanying drawing figures.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 shows a flowchart of method steps according to the present invention;

FIG. 2 shows a system modeled as a Markov Decision Problem;

FIG. 3 shows a communications network wherein access control is carried out in a switching unit according to the present invention;

FIG. 4 shows a function approximator for approximative dynamic programming according to the present invention;

FIG. 5 shows a plurality of function approximators for approximative dynamic programming according to the present invention; and

FIG. 6 shows a traffic management system subjected to closed-loop control in accordance with the present invention.

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

FIG. 1 shows a flowchart according to the present invention, in which individual method steps of a first embodiment are provided, which will be discussed later.

FIG. 2 shows the structure of a typical Markov Decision Problem method.

The system 201 is in a state x_(t) at an instant t. The state x_(t) can be observed by an observer of the system. On the basis of an action a_(t) from a set in the state x_(t) of possible actions, a_(t)εA(x_(t)), the system makes a transition with a certain probability into a subsequent state x_(t)+1 at a subsequent instant t+1.

As illustrated diagrammatically in FIG. 2 by a loop, an observer 200 perceives 202 observable variables concerning the state x_(t) and takes a decision via an action 203 with which it acts on the system 201. The system 201 is usually subject to the interference 205.

The observer 200 obtains a gain r_(t) 204 r _(t) =r(x _(t) , a _(t) , x _(t+1)) ερ,  (1) which is a function of the action a_(t) 203 and the original state x_(t) at the instant t as well as of the subsequent state x_(t)+1 of the system at the subsequent instant t+1.

The gain r_(t) can assume a positive or negative scalar value depending on whether the decision leads, with regard to a prescribable criterion, to a positive or negative system development, to an increase in capital stock or to a loss.

In a further time step, the observer 200 of the system 201 decides on the basis of the observable variables 202, 204 of the subsequent state x_(t+1) in favor of a new action a_(t+1), etc.

A sequence of

State: x_(t)εX

Action: a_(t)εA(x_(t))

Subsequent state: x_(t)+1εX

Gain r_(t) =r(x _(t) , a _(t) , x _(t+1)) ερ

describes a trajectory of the system which is evaluated by a performance criterion which accumulates the individual gains r_(t) over the instants t. It is assumed by way of simplification in a Markov Decision Problem that the state x_(t) and the action a_(t) all contain information for the purpose of describing a transition probability p(x_(t+1)|·) of the system from the state x_(t) to the subsequent state x_(t+1).

In formal terms, this means that: p(x _(t+1) |x _(t) , K, x ₀ , a _(t) , K, a ₀)=p(x _(t+1) |x _(t) , a _(t)).  (2) p(x_(t+1) |x _(t) , a _(t)) denotes a transition probability for the subsequent state x_(t+1) for a given state x_(t) and given action a_(t).

In a Markov Decision Problem, future states of the system 201 are thus not a function of states and actions which lie further in the past than one time step.

FIG. 3 shows an embodiment of the present invention involving an access control and routing system, such as a communications network 300.

The communications network 300 has a multiplicity of switching units 301 a, 301 b, . . . , 301 i, . . . 301 n, which are interconnected via connections 302 a, 302 b, 302 j, . . . 302 m. A first terminal 303 is connected to a first switching unit 301 a. From the first terminal 303, the first switching unit 301 a is sent a request message 304 which requests preservation of a prescribed bandwidth within the communications network 300 for the purpose of transmitting data, such as video data or text data.

It is determined in the first switching unit 301 a in accordance with a strategy described below, whether the requested bandwidth is available in the communications network 300 on a specified, requested connection instep 305. The request is refused instep 306 if this is not the case. If sufficient bandwidth is available, it is checked in checking step 307 whether the bandwidth can be reserved.

The request is refused in step 308 if this is not the case. Otherwise, the first switching unit 301 a selects a route from the first switching unit 301 a via further switching units 301 i to a second terminal 309 with which the first terminal 303 wishes to communicate, and a connection is initialized in step 310.

The starting point below is a communications network 300 which comprises a set of switching units N={1, K, n, K, N}  (17) and a set of physical connections L={1, K, 1, K, L},  (18) a physical connection l having a capacity of B(l) bandwidth units.

A set M={1, K, m, K, M}  (19) of different types of service m are available, a type of service m being characterized by a bandwidth requirement b(m), an average connection time

$\frac{1}{V(m)},$ and a gain c(m) which is obtained whenever a call request of the corresponding type of service m is accepted.

The gain c(m) is given by the amount of money which a network operator of the communications network 300 bills a subscriber for a connection of the type of service. Clearly, the gain c(m) reflects different priorities, which can be prescribed by the network operator and which he associates with different services.

A physical connection 1 can simultaneously provide any desired combination of communications connections as long as the bandwidth used for the communications connections does not exceed the bandwidth available overall for the physical connection.

If a new communications connection of type m is requested between a first node i and a second node j (terminals are also denoted as nodes), the requested communications connection can, as represented above, either be accepted or be refused. If the communications connection is accepted, a route is selected from a set of prescribed routes. This selection is denoted as a routing. b(m) bandwidth units are used in the communications connection of type m for each physical connection along the selected route for the duration of the connection.

Thus, during access control, also referred to as call admission control, a route can be selected within the communications network 300 only when the selected route has sufficient bandwidth available. The aim of the access control and of the routing is to maximize a long term gain which is obtained by acceptance of the requested connections.

At an instant t, the technical system which is the communications network 300 is in a state x_(t) which is described by a list of routes via existing connections, by means of which lists it is shown how many connections of which type of service are using the respective routes at the instant t.

Events w, by means of which a state x_(t) could be transferred into a subsequent state x_(t+1), are the arrival of new connection request messages, or else the termination of a connection existing in the communications network 300.

In this embodiment, an action a_(t) at an instant t, owing to a connection request is the decision as to whether a connection request is to be accepted or refused and, if the connection is accepted, the selection of the route through the communications network 300.

The aim is to determine a sequence of actions, that is to say clearly to determine the learning of a strategy with actions relating to a state x_(t) in such a way that the following rule is maximized:

$\begin{matrix} {{E\left( {\sum\limits_{k = 0}^{\infty}\;{e^{{- \beta}\; t_{k}} \cdot {g\left( {x_{t_{k}},\omega_{k},a_{t_{k}}} \right)}}} \right)},} & (20) \end{matrix}$ E{.} denoting an expectation, t_(k) denoting an instant at which a kth event takes place, g(x_(tk), ω_(k), a_(tk)). denoting the gain which is associated with the kth event, and β denoting a reduction factor which evaluates an immediate gain as being more valuable than a gain at instants lying further in the future.

Different implementations of a strategy lead normally to different overall gains

G:

$\begin{matrix} {G = {\sum\limits_{k = 0}^{\infty}\;{e^{{- \beta}\; t_{k}} \cdot {{g\left( {x_{t_{k}},\omega_{k},a_{t_{k}}} \right)}.}}}} & (21) \end{matrix}$

The aim is to maximize the expectation of the overall gain G in accordance with the following rule J:

$\begin{matrix} {{J = {E\left\{ {\sum\limits_{k = 0}^{\infty}\;{e^{{- \beta}\; t_{k}} \cdot {g\left( {x_{t_{k}},\omega_{k},a_{t_{k}}} \right)}}} \right\}}},} & (22) \end{matrix}$ it being possible to set a risk which reduces the overall gain G of a specific implementation of access control and of a routing strategy to below the expectation.

The TD(λ)-learning method is used to carry out the access control and the routing.

The following target function is used in this embodiment:

$\begin{matrix} {{{{J^{*}\left( x_{t} \right)} = {{E\;}_{\tau}\left\{ e^{- {\beta\tau}} \right\}{E\;}_{\omega}\left\{ {\max\limits_{a\;\varepsilon\; A}\left\lbrack \;{{g\left( {x_{t},\omega_{t},a} \right)} + {J^{*}\left( x_{t + 1} \right)}} \right\rbrack} \right\}}},}\;} & (23) \end{matrix}$ A denoting an action space with a prescribed number of actions which are respectively available in a state x_(t), τ denoting a first instant at which a first event ω occurs, and x_(t+1) denoting a subsequent state of the system.

An approximated value of the target value J^(*)(x_(t)) is learned and stored by employing a function approximator 400 (compare FIG. 4) with the use of training data.

Training data are data previously measured in the communications network 300 and relating to the behavior of the communications network 300 in the case of incoming connection requests 304 and of termination of messages. This time sequence of states is stored, and these training data are used to train the function approximator 400 in accordance with the learning method described below.

A number of connections of in each case one type of service m on a route of the communications network 300 serve in each case as input variable of the function approximator 400 for each input 401, 402, 403 of the function approximator 400. These are represented in FIG. 4 by blocks 404, 405, 406. An approximated target value {tilde over (J)} of the target value J^(*) is the output variable of the function approximator 400.

FIG. 5 shows a detailed representation of a function approximator 500, which has several component function approximators 510, 520.

One output variable is the approximated target value {tilde over (J)}, which is formed in accordance with the following rule:

$\begin{matrix} {{\overset{\sim}{J}\left( {x_{t},\Theta} \right)} = {\sum\limits_{l = 1}^{L}\;{{{\overset{\sim}{J}}^{(l)}\left( {x_{t}^{(l)},\Theta_{t}^{(l)}} \right)}.}}} & (24) \end{matrix}$

The input variables of the component function approximators 510, 520, which are present at the inputs 511, 512, 513 of the first component function approximator 510, or at the inputs 521, 522 and 523 of the second component function approximator 520 are, in turn, respectively a number of types of service of a type m in a physical connection r in each case, symbolized by blocks 514, 515, 516 for the first component function approximator, and 524, 525 and 526 for the second component function approximator 520.

Component output variables 530, 531, 532, 533 are fed to an adder unit 540, and the approximated target variable {tilde over (J)} is formed as output variable of the adder unit.

Let it be assumed that the communications network 300 is in the state x_(t) _(k) and that a request message with which a type of service m of class m is requested for a connection between two nodes i, j reaches the first switching unit 301 a.

A list of permitted routes between the nodes i and j is denoted by R(i, j), and a list of all possible routes is denoted by {tilde over (R)}(i, j, x _(t) _(k) )⊂R(i, j)  (25) as a subset of the routes R(i, j) which could implement a possible connection with regard to the available and requested bandwidth.

For each possible route r, rε{tilde over (R)}(i,j,x_(t) _(k) ), a subsequent state x_(t) _(k) +1(x_(t) _(k) , ω_(k),r) is determined which results from the fact that the connection request 304 is accepted and the connection on the route r is made available to the requesting first terminal 303.

This is illustrated in FIG. 1 as step 102, the state of the system and the respective event being respectively determined in step 101. A route r^(*) to be selected is determined in step 103 in accordance with the following rule: r ^(*) =arg _(rε{tilde over (R)}(i,j,x) _(tk) )max {tilde over (J)}(x _(t) _(k) +1(x _(t) _(k) ,ω_(k) , r), Θ_(t).  (26)

A check is made in step 104 as to whether the following rule is fulfilled: c(m)+{tilde over (J)}(x _(t) _(k) +1(x _(t) _(k) , ω_(k) , r ^(*)), Θ_(t))<{tilde over (J)}(x _(t) _(k) , Θ_(t)).   (27)

If this is the case, the connection request 304 is rejected in step 105, otherwise the connection is accepted and “switched through” to the node j along the selected route r^(*) in step 106.

Weights of the function approximator 400, 500 which are adapted in the TD(λ)-learning method to the training data, are stored in a parameter vector Θ for an instant t in each case, such that an optimized access control and an optimized routing are achieved.

During the training phase, the weighting parameters are adapted to the training data applied to the function approximator.

A risk parameter κ is defined with the aid of which a desired risk, which the system has with regard to a prescribed state owing to a sequence of actions and states, can be set in accordance with the following rules:

−1≦κ<0: risky learning,

κ=0: neutral learning with regard to the risk,

0<κ<1: risk-avoiding learning,

κ=1: worst-case learning.

Furthermore, a prescribable parameter 0≦λ≦1 and a step size sequence γk are prescribed in the learning method.

The weighting values of the weighting vector Θ are adapted to the training data on the basis of each event ω_(tk) in accordance with the following adaptation rule: Θ_(k)=Θ_(k−1)=γk^(ηκ)(d_(k))z_(t),  (28) in which case d _(k) =e ^(−β(t) ^(k) ^(−t) ^(k−1) ⁾(g(x_(t) _(k) , ω_(k) , a _(t) _(k) )+{tilde over (J)}(x_(t) _(k) , Θ_(k−1)))−{tilde over (J)}(x_(t) _(k−1) , Θ_(k−1))  (29) z_(t) =λe ^(−β(t) ^(k−1) ^(−t) ^(k−2) )z _(t−1) +∇Θ{tilde over (J)}(x _(t) _(k−1) , Θ_(k−1)),   (30) and

^(κ)(ξ)=(1−κsign(ξ))ξ.   (31) It is assumed that: z₁=0.

The function g(x _(t) _(k) , ω_(k), a_(t) _(k) )   (32) denotes the immediate gain in accordance with the following rule:

$\begin{matrix} {{g\left( {x_{t_{k}},\omega_{k},a_{t_{k}}} \right)} = \left\{ \begin{matrix} {c(m)} & {{when}\mspace{14mu}\omega_{t_{k}}\mspace{14mu}{is}\mspace{14mu} a\mspace{14mu}{service}\mspace{14mu}{request}\mspace{14mu}{for}\mspace{14mu} a\mspace{14mu}{type}\mspace{14mu}{of}} \\ \; & {{{service}\mspace{14mu} m}\;,\mspace{11mu}{{and}\mspace{14mu}{the}\mspace{14mu}{connection}\mspace{14mu}{is}\mspace{14mu}{accepted}}} \\ 0 & {otherwise} \end{matrix} \right.} & (33) \end{matrix}$

Thus, as described above, a sequence of actions is determined with regard to a connection request such that a connection request is either rejected or accepted on the basis of an action. The determination is performed taking account of an optimization function in which the risk can be set by means of a risk control parameter κε[−1; 1] in a variable fashion.

FIG. 6 shows an embodiment of the present invention in relation to a traffic management system

A road 600 on which automobiles 601, 602, 603, 604, 605 and 606 are being driven. Conductor loops 610, 611 integrated into the road 600 receive electric signals in a known way and feed the electric signals 615, 616 to a computer 620 via an input/output interface 621. In an analog-to-digital converter 622 connected to the input/output interface 621, the electric signals are digitized into a time series and stored in a memory 623, which is connected by a bus 624 to the analog-to-digital converter 622 and a processor 625. Via the input/output interface 621, a traffic management system 650 is fed control signals 651 from which it is possible to set a prescribed speed stipulation 652 in the traffic management system 650, or else further particulars of traffic regulations, which are displayed via the traffic management system 650 to drivers of the vehicles 601, 602, 603, 604, 605 and 606.

The following local state variables are used in this case for the purpose of traffic modeling:

traffic flow rate v,

vehicle density p (p= number of vehicles per kilometer

$\frac{F\; z}{km}$ traffic flow q (q= number of vehicles per hour

$\frac{F\; z}{h},$ (q=v^(*)p)), and speed restrictions 652 displayed by the traffic management system 650 at an instant in each case.

The local state variables are measured as described above by using the conductor loops 610, 611.

These variables (v(t), p(t), q(t)) therefore represent a state of the technical system of “traffic” at a specific instant t.

In this embodiment, the system is therefore a traffic system which is controlled by using the traffic management system 650, and an extended Q-learning method is described as method of approximative dynamic programming.

The state x_(t) is described by a state vector x(t)=(v(t), p(t), q(t))  (34)

The action a_(t) denotes the speed restriction 652, which is displayed at the instant t by the traffic management system 650. The gain r(x_(t), a_(t), x_(t+1)) describes the quality of the traffic flow which was measured between the instants t and t+1 by the conductor loops 610 and 611.

In this embodiment, r(x_(t), a_(t), x_(t+1)) denotes

the average speed of the vehicles in the time interval [t, t+1]

or

the number of vehicles which have passed the conductor loops 610 and 611 in the time interval [t, t+1]

or

the variance of the vehicle speeds in the time interval [t, t+1],

or

a weighted sum from the above variables.

A value of the optimization function OFQ is determined for each possible action a_(t), that is to say for each speed restriction which can be displayed by the traffic management system 650, an estimated value of the optimization function OFQ being realized in each case as a neural network.

This results in a set of evaluation variables for the various actions a_(t) in the system state x_(t). Those actions a_(t) for which the maximum evaluation variable OFQ has been determined in the current system state x_(t) are selected in a control phase from the possible actions a_(t), that is to say from the set of the speed restrictions which can be displayed by the traffic management system 650.

In accordance with this embodiment, the adaptation rule, known from the Q-learning method, for calculating the optimization function OFQ is extended by a risk control function

^(κ)(.), which takes account of the risk.

In turn, the risk control parameter κ is prescribed in accordance with the strategy from the first exemplary embodiment in the interval of [−1≦κ≦1], and represents the risk which a user wishes to run in the application with regard to the control strategy to be determined.

The following evaluation function OFQ is used in accordance with this exemplary embodiment: OFQ=Q(x; w ^(a)),  (35) x=(v; p; q) denoting a state of the traffic system, a denoting a speed restriction from the action space A of all speed restrictions which can be displayed by the traffic management system 650, and w^(a) denoting the weights of the neural network which belong to the speed restriction a.

The following adaptation step is executed in Q-learning in order to determine the optimum weights w^(a) of the neural network: w _(t+1) ^(a) ^(t) =w _(t) ^(a) ^(t) +η_(t)·η^(κ)(d_(t))·∇Q(x _(t) ; w _(t) ^(a) ^(t) )  (36) using the abbreviation:

$\begin{matrix} {d_{t} = {{r\left( {x_{t},a_{t},x_{t + 1}} \right)} + {\gamma\mspace{14mu}{\max\limits_{a\;\varepsilon\; A}\mspace{14mu}{Q\left( {x_{t + 1},w_{t}^{a}} \right)}}} - {Q\left( {x_{t},w_{t}^{a_{t}}} \right)}}} & (37) \end{matrix}$ x_(t), x_(t+1) denoting in each case a state of the traffic system in accordance with rule (34), a_(t) denoting an action, that is to say a speed restriction which can be displayed by the traffic management system 650, γ denoting a prescribable reduction factor, w_(t) ^(a) ^(t) denoting the weighting vector belonging to the action a_(t), before the adaptation step, w_(t+1) ^(a) ^(t) denoting the weighting vector belonging to the action a_(t), after the adaptation step, η_(t)(t=1, . . . ) denoting a prescribable step size sequence, κε[−1; 1] denoting a risk control parameter,

^(κ) denoting a risk control function

^(κ) (ξ)=(1−κsign(ξ))ξ, ∇_(Q)(;) denoting the derivative of the neural network with respect to its weights, and r(x_(t), a_(t), x_(t+1)) denoting a gain upon the transition in state from the state x_(t) to the subsequent state x_(t+1).

An action a_(t) can be selected at random from the possible actions a_(t) during learning. It is not necessary in this case to select the action a_(t) which has led to the largest evaluation variable.

The adaptation of the weights has to be performed in such a way that not only is a traffic control achieved which is optimized in terms of the expectation of the optimization function, but that also account is taken of a variance of the control results.

This is particularly advantageous since the state vector x(t) models the actual system of traffic only inadequately in some aspects, and so unexpected disturbances can thereby occur. Thus, the dynamics of the traffic, and therefore of its modeling, depend on further factors such as weather, proportion of trucks on the road, proportion of mobile homes, etc., which are not always integrated in the measured variables of the state vector x(t). In addition, it is not always ensured that the road users immediately implement the new speed instructions in accordance with the traffic management system.

A control phase on the real system in accordance with the traffic management system takes place in accordance with the following steps:

1. The state x_(t) is measured at the instant t at various points in the traffic system of traffic and yields a state vector x(t):=(v(t), p(t), q(t)). 2. A value of the optimization function is determined for all possible actions a_(t), and that action a_(t) with the highest evaluation in the optimization function is selected.

Although modifications and changes may be suggested by those skilled in the art to which this invention pertains, it is the intention of the inventors to embody within the patent warranted hereon all changes and modifications that may reasonably and properly come under the scope of their contribution to the art. 

1. A method for computer-aided determination of a sequence of actions for a system having states, the method comprising the steps of: performing a transition in state between two states on the basis of an action; determining the sequence of actions to be performed such that a sequence of states results from the sequence of actions; optimizing the sequence of states with regard to a prescribed optimization function, including a variable parameter; and using the variable parameter to set a risk which the resulting sequence of states has with respect to a prescribed state of the system.
 2. The method as claimed in claim 1, further comprising the step of: using approximative dynamic programming for the purpose of determination.
 3. The method as claimed in claim 2, further comprising the step of: basing the approximative dynamic programming on Q-learning.
 4. The method as claimed in claim 3, further comprising the steps of: forming an optimization function with Q-learning in accordance with the following rule: OFQ=Q(x; w ^(a)), and adapting weights of the function approximator in accordance with the following rule: w _(t+1) ^(a) ^(t) =w _(t) ^(a) ^(t) +η_(t)·

^(κ)(d_(t))·∇Q(x_(t) ; w _(t) ^(a) ^(t) ) wherein $d_{t} = {{r\left( {x_{t},a_{t},x_{t + 1}} \right)} + {\gamma\mspace{14mu}{\max\limits_{a\;\varepsilon\; A}\mspace{14mu}{Q\left( {x_{t + 1},w_{t}^{a_{t}}} \right)}}} - {{Q\left( {x_{t},w_{t}^{a_{t}}} \right)}.}}$
 5. The method as claimed in claim 2, further comprising the step of: basing the approximative dynamic programming on TD(λ)-learning.
 6. The method as claimed in claim 5, further comprising the steps of: forming the optimization function within TD(λ)-learning in accordance with the following rule: OFTD=J(x; w); and adapting weights of the function approximator are adapted in accordance with the following rule: w _(t+1) =w _(t)+η_(t)·

^(κ)(d_(t))·z_(t), wherein d _(t) =r(w_(t), a_(t), x_(t+1))+γJ(x _(t)+1; w _(t)), z_(t) =λ·γ·z _(t−1) ∇J(x_(t) ; w _(t)), and z ⁻¹=0.
 7. The method as claimed in claim 6, further comprising the step of: using a technical system to determine the sequence of actions before the determination measured values are measured.
 8. The method as claimed in claim 7, further comprising the step of: subjecting the technical system to open-loop control in accordance with the sequence of actions.
 9. The method as claimed in claim 7, further comprising the step of: subjecting the technical system to closed-loop control in accordance with the sequence of actions.
 10. The method as claimed in claim 9, further comprising the step of: modeling the system as a Markov Decision Problem.
 11. The method as claimed in claim 10, further comprising the step of: using the system in a traffic management system.
 12. The method as claimed in claim 10, further comprising the step of: using the system in a communications system.
 13. The method as claimed in claim 10, further comprising the step of: using the system to carry out access control in a communications network.
 14. The method as claimed in claim 10, further comprising the step of: using the system to carry out routing in a communications network.
 15. A system for determining a sequence of actions for a system having states, wherein a transition in state between two states is performed on the basis of an action, the system comprising: a processor for determining a sequence of actions, whereby a sequence of states resulting from the sequence of actions is optimized with regard to a prescribed optimization function, and the optimization function includes a variable parameter for setting a risk which the resulting sequence of states has with respect to a prescribed state of the system.
 16. The system as claimed in claim 15, wherein the processor is used to subject a technical system to open-loop control.
 17. The system as claimed in claim 15, wherein the processor is used to subject a technical system to closed-loop control.
 18. The system as claimed in claim 15, wherein the processor is used in a traffic management system.
 19. The system as claimed in claim 15, wherein the processor is used in a communication system.
 20. The system as claimed in claim 15, wherein the processor is used to carry out access control in a communications network.
 21. The system as claimed in claim 15, wherein the processor is used to carry out routing in a communications network. 